29 research outputs found

    Statistical analysis of the mixed fractional Ornstein--Uhlenbeck process

    Full text link
    This paper addresses the problem of estimating drift parameter of the Ornstein - Uhlenbeck type process, driven by the sum of independent standard and fractional Brownian motions. The maximum likelihood estimator is shown to be consistent and asymptotically normal in the large-sample limit, using some recent results on the canonical representation and spectral structure of mixed processes.Comment: to appear in Theory of Probability and its Application

    Mixed Gaussian processes: A filtering approach

    Full text link
    This paper presents a new approach to the analysis of mixed processes Xt=Bt+Gt,t[0,T],X_t=B_t+G_t,\qquad t\in[0,T], where BtB_t is a Brownian motion and GtG_t is an independent centered Gaussian process. We obtain a new canonical innovation representation of XX, using linear filtering theory. When the kernel K(s,t)=2stEGtGs,stK(s,t)=\frac{\partial^2}{\partial s\,\partial t}\mathbb{E}G_tG_s,\qquad s\ne t has a weak singularity on the diagonal, our results generalize the classical innovation formulas beyond the square integrable setting. For kernels with stronger singularity, our approach is applicable to processes with additional "fractional" structure, including the mixed fractional Brownian motion from mathematical finance. We show how previously-known measure equivalence relations and semimartingale properties follow from our canonical representation in a unified way, and complement them with new formulas for Radon-Nikodym densities.Comment: Published at http://dx.doi.org/10.1214/15-AOP1041 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

    A complete solution to Blackwell's unique ergodicity problem for hidden Markov chains

    Full text link
    We develop necessary and sufficient conditions for uniqueness of the invariant measure of the filtering process associated to an ergodic hidden Markov model in a finite or countable state space. These results provide a complete solution to a problem posed by Blackwell (1957), and subsume earlier partial results due to Kaijser, Kochman and Reeds. The proofs of our main results are based on the stability theory of nonlinear filters.Comment: Published in at http://dx.doi.org/10.1214/10-AAP688 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Model robustness of finite state nonlinear filtering over the infinite time horizon

    Full text link
    We investigate the robustness of nonlinear filtering for continuous time finite state Markov chains, observed in white noise, with respect to misspecification of the model parameters. It is shown that the distance between the optimal filter and that with incorrect model parameters converges to zero uniformly over the infinite time interval as the misspecified model converges to the true model, provided the signal obeys a mixing condition. The filtering error is controlled through the exponential decay of the derivative of the nonlinear filter with respect to its initial condition. We allow simultaneously for misspecification of the initial condition, of the transition rates of the signal, and of the observation function. The first two cases are treated by relatively elementary means, while the latter case requires the use of Skorokhod integrals and tools of anticipative stochastic calculus.Comment: Published at http://dx.doi.org/10.1214/105051606000000871 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Stability of nonlinear filters in nonmixing case

    Full text link
    The nonlinear filtering equation is said to be stable if it ``forgets'' the initial condition. It is known that the filter might be unstable even if the signal is an ergodic Markov chain. In general, the filtering stability requires stronger signal ergodicity provided by the, so called, mixing condition. The latter is formulated in terms of the transition probability density of the signal. The most restrictive requirement of the mixing condition is the uniform positiveness of this density. We show that it might be relaxed regardless of an observation process structure.Comment: Published at http://dx.doi.org/10.1214/105051604000000873 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

    On the Viterbi process with continuous state space

    Full text link
    This paper deals with convergence of the maximum a posterior probability path estimator in hidden Markov models. We show that when the state space of the hidden process is continuous, the optimal path may stabilize in a way which is essentially different from the previously considered finite-state setting.Comment: Published in at http://dx.doi.org/10.3150/10-BEJ294 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm

    Populations with interaction and environmental dependence: From few, (almost) independent, members into deterministic evolution of high densities

    Get PDF
    Many populations, e.g. not only of cells, bacteria, viruses, or replicating DNA molecules, but also of species invading a habitat, or physical systems of elements generating new elements, start small, from a few lndividuals, and grow large into a noticeable fraction of the environmental carrying capacity K or some corresponding regulating or system scale unit. Typically, the elements of the initiating, sparse set will not be hampering each other and their number will grow from Z0 = z0 in a branching process or Malthusian like, roughly exponential fashion, Zt ~atW, where Z t is the size at discrete time t → ∞, a > 1 is the offspring mean per individual (at the low starting density of elements, and large K), and W a sum of z0 i.i.d. random variables. It will, thus, become detectable (i.e. of the same order as K) only after around K generations, when its density Xt := Z t /K will tend to be strictly positive. Typically, this entity will be random, even if the very beginning was not at all stochastic, as indicated by lower case z0 , due to variations during the early development. However, from that time onwards, law of large numbers effects will render the process deterministic, though inititiated by the random density at time log K, expressed through the variable W. Thus, W acts both as a random veil concealing the start and a stochastic initial value for later, deterministic population density development. We make such arguments precise, studying general density and also system-size dependent, processes, as K → ∞. As an intrinsic size parameter, K may also be chosen to be the time unit. The fundamental ideas are to couple the initial system to a branching process and to show that late densities develop very much like iterates of a conditional expectation operator. The “random veil”, hiding the start, was first observed in the very concrete special case of finding the initial copy number in quantitative PCR under Michaelis-Menten enzyme kinetics, where the initial individual replication variance is nil if and only if the efficiency is one, i.e. all molecules replicate

    Maximum Likelihood Estimator for Hidden Markov Models in continuous time

    Full text link
    The paper studies large sample asymptotic properties of the Maximum Likelihood Estimator (MLE) for the parameter of a continuous time Markov chain, observed in white noise. Using the method of weak convergence of likelihoods due to I.Ibragimov and R.Khasminskii, consistency, asymptotic normality and convergence of moments are established for MLE under certain strong ergodicity conditions of the chain.Comment: Warning: due to a flaw in the publishing process, some of the references in the published version of the article are confuse
    corecore